Codes and Graphs
نویسنده
چکیده
In this paper, I will give a brief introduction to the theory of low-density parity-check codes, and their decoding. I will emphasize the case of correcting erasures as it is still the best understood and most accessible case. At the end of the paper, I will also describe more recent developments.
منابع مشابه
Total perfect codes, OO-irredundant and total subdivision in graphs
Let $G=(V(G),E(G))$ be a graph, $gamma_t(G)$. Let $ooir(G)$ be the total domination and OO-irredundance number of $G$, respectively. A total dominating set $S$ of $G$ is called a $textit{total perfect code}$ if every vertex in $V(G)$ is adjacent to exactly one vertex of $S$. In this paper, we show that if $G$ has a total perfect code, then $gamma_t(G)=ooir(G)$. As a consequence, ...
متن کاملUse of Structure Codes (Counts) for Computing Topological Indices of Carbon Nanotubes: Sadhana (Sd) Index of Phenylenes and its Hexagonal Squeezes
Structural codes vis-a-vis structural counts, like polynomials of a molecular graph, are important in computing graph-theoretical descriptors which are commonly known as topological indices. These indices are most important for characterizing carbon nanotubes (CNTs). In this paper we have computed Sadhana index (Sd) for phenylenes and their hexagonal squeezes using structural codes (counts). Sa...
متن کاملThe locating-chromatic number for Halin graphs
Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...
متن کاملBinary Codes of Strongly Regular Graphs
For strongly regular graphs with adjacency matrix A, we look at the binary codes generated by A and A+ I . We determine these codes for some families of graphs, we pay attention to the relation between the codes of switching equivalent graphs and, with the exception of two parameter sets, we generate by computer the codes of all known strongly regular graphs on fewer than 45 vertices.
متن کاملCodes on Planar Graphs
Codes defined on graphs and their properties have been subjects of intense recent research. On the practical side, constructions for capacity-approaching codes are graphical. On the theoretical side, codes on graphs provide several intriguing problems in the intersection of coding theory and graph theory. In this paper, we study codes defined by planar Tanner graphs. We derive an upper bound on...
متن کاملOn graphs and codes preserved by edge local complementation
Orbits of graphs under local complementation (LC) and edge local complementation (ELC) have been studied in several different contexts. For instance, there are connections between orbits of graphs and errorcorrecting codes. We define a new graph class, ELC-preserved graphs, comprising all graphs that have an ELC orbit of size one. Through an exhaustive search, we find all ELC-preserved graphs o...
متن کامل